Ultrafast Shortest-Path Queries via Transit Nodes

نویسندگان

  • Hannah Bast
  • Stefan Funke
  • Domagoj Matijevic
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

TRANSIT Ultrafast Shortest-Path Queries with Linear-Time Preprocessing

We introduce the concept of transit nodes, as a means for preprocessing a road network, with given coordinates for each node and a travel time for each edge, such that point-to-point shortest-path queries can be answered extremely fast. The transit nodes are a set of nodes as small as possible with the property that every shortest path that is non-local in the sense that it covers a certain not...

متن کامل

Robust, Almost Constant Time Shortest-Path Queries in Road Networks

When you drive to somewhere ‘far away’, you will leave your current location via one of only a few ‘important’ traffic junctions. Recently, other research groups and we have largely independently developed this informal observation into transit node routing, a technique for reducing quickest-path queries in road networks to a small number of table lookups. The contribution of our paper is twofo...

متن کامل

Finding the Shortest Path in Dynamic Network using Labeling Algorithm

This study concerns the problem of finding shortest paths from one node to all other nodes in networks for which arc costs can vary with time, each arc has a transit time and parking with a corresponding time-varying cost is allowed at the nodes. it show that this problem is equivalent to a classical shortest path problem in a timeexpanded network. The label correcting algorithm is used for fin...

متن کامل

Contraction Hierarchies: Faster and Simpler Hierarchical Routing in Road Networks

We present a route planning technique solely based on the concept of node contraction. The nodes are first ordered by ‘importance’. A hierarchy is then generated by iteratively contracting the least important node. Contracting a node v means replacing shortest paths going through v by shortcuts. We obtain a hierarchical query algorithm using bidirectional shortest-path search. The forward searc...

متن کامل

In Transit to Constant Time Shortest-Path Queries in Road Networks

When you drive to somewhere ‘far away’, you will leave your current location via one of only a few ‘important’ traffic junctions. Starting from this informal observation, we develop an algorithmic approach—transit node routing— that allows us to reduce quickest-path queries in road networks to a small number of table lookups. We present two implementations of this idea, one based on a simple gr...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2006